Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties
نویسندگان
چکیده
This paper presents an efficient approach to the classification of the affine equivalence classes of cosets of the first order ReedMuller code with respect to cryptographic properties such as correlationimmunity, resiliency and propagation characteristics. First, we apply the method to completely classify all the 48 classes into which the general affine group AGL(2, 5) partitions the cosets of RM(1, 5). Second, after distinguishing the 34 affine equivalence classes of cosets of RM(1, 6) in RM(3, 6) we perform the same classification for these classes. Finally, we introduce two new indicators which can be used to distinguish affine inequivalent Boolean functions when the known criteria are not sufficient. From these indicators a method can be derived for finding the affine relation between two functions (if it exists). The efficiency of the method depends on the structure of the Walsh or autocorrelation spectrum.
منابع مشابه
Classification of Boolean Functions of 6 Variables or Less with Respect to Cryptographic Properties
This paper presents an efficient approach for classification of the affine equivalence classes of cosets of the first order Reed-Muller code with respect to cryptographic properties such as correlationimmunity, resiliency and propagation characteristics. First, we apply the method to completely classify all the 48 classes into which the general affine group AGL(2, 5) partitions the cosets of RM...
متن کاملCryptographic Boolean Functions with R
A Boolean function is a mapping {0,1}n → {0,1}. Those mappings are of much interest in the design of cryptographic algorithms such as secure pseudorandom number generators (for the design of stream ciphers among other applications), hash functions and block ciphers. The lack of open source software to assess cryptographic properties of Boolean functions and the increasing interest for statistic...
متن کاملStructures of Highly Nonlinear Cryptographic Functions
This paper studies the properties and constructions of nonlinear Boolean functions, which are a core component of cryptographic primitives including data encryption algorithms and one-way hash functions. A main contribution of this paper is to completely characterise the structures of cryptographic functions that satisfy the propagation criterion with respect to all but six or less vectors.
متن کاملOn Boolean Functions with Generalized Cryptographic Properties
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric. This approach leads to the construction of “handmade” Boolean functions, i.e., functions for whi...
متن کامل